2010 Paper 7 Question 5 Bioinformatics (a) Discuss the space–time complexity of dynamic programming algorithms in sequence alignment. [7 marks]

Source URL: www.cl.cam.ac.uk

BRICS Basic Research in Computer Science BRICS RSL. Kristiansen: The Implicit Computational Complexity of Imperative Programming Languages The Implicit Computational Complexity of

Source URL: www.brics.dk

Hierarchical Learning from Demonstration on Humanoid Robots Keith Sullivan, Sean Luke, and Vittorio Amos Ziparo Abstract— Developing behaviors for humanoid robots is difficult due to the high complexity of programming

Source URL: cs.gmu.edu

Research Proposal: Jean Yang 1 The abstraction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine

Source URL: web.mit.edu

UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 8 Due on April 3 at 3:30 p.m.

Source URL: www.cs.berkeley.edu

• Computational complexity theory
• Analysis of algorithms
• Mosaic
• Symmetry
• Tessellation
• Algorithm
• Time complexity
• Dynamic programming
• Euclidean algorithm
• Theoretical computer science
• Applied mathematics
• Mathematics

CME 305: Discrete Mathematics and Algorithms 1 Approximation Algorithms

Source URL: stanford.edu

• Operations research
• Computational complexity theory
• NP-complete problems
• Job shop scheduling
• Mathematical optimization
• Approximation algorithm
• Linear programming
• Algorithm
• Vertex cover
• Theoretical computer science
• Applied mathematics
• Mathematics

The Complexity of Flow Analysis in Higher-Order Languages David Van Horn The Complexity of Flow Analysis in

Source URL: www.ccs.neu.edu

• Models of computation
• Notation
• Programming language
• Lambda calculus
• Control flow analysis
• Algorithm
• International Conference on Functional Programming
• Functional programming
• Computational complexity theory
• Theoretical computer science
• Applied mathematics
• Computer science

The Complexity of the Routing Problem in POR Wei Hu, Jin Xie, and Zhenghao Zhang Computer Science Department Florida State University Tallahassee, FL 32306, USA Abstract—We have designed and implemented a new protocol

Source URL: www.cs.fsu.edu

• Optimization problem
• Applied mathematics
• Constraint programming
• Theoretical computer science
• 2-satisfiability
• Mathematics

Mathematical Programming manuscript No. (will be inserted by the editor) Sanjeev Arora ?

Source URL: www.cs.duke.edu

• NP-complete problems
• Complexity classes
• Approximation algorithms
• Spanning tree
• Travelling salesman problem
• Polynomial-time approximation scheme
• Time complexity
• Optimization problem
• Algorithm
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

CS 170 Algorithms Spring 2009

Source URL: www-inst.eecs.berkeley.edu

• Operations research
• Numerical software
• Convex optimization
• Linear programming
• Algorithm
• Mathematical optimization
• Solver
• Time complexity
• PROPT
• Theoretical computer science
• Applied mathematics
• Mathematics